Büchi automaton

Results: 70



#Item
21IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 48, NO. 2, FEBRUARYFeedback Can Reduce the Specification Complexity of Motor Programs

IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 48, NO. 2, FEBRUARYFeedback Can Reduce the Specification Complexity of Motor Programs

Add to Reading List

Source URL: hrl.harvard.edu

Language: English - Date: 2003-11-10 22:28:54
22Noname manuscript No. (will be inserted by the editor) Synchronizing Relations on Words Diego Figueira · Leonid Libkin

Noname manuscript No. (will be inserted by the editor) Synchronizing Relations on Words Diego Figueira · Leonid Libkin

Add to Reading List

Source URL: homepages.inf.ed.ac.uk

Language: English - Date: 2014-11-26 07:54:43
23Regular Sensing Shaull Almagor1 , Denis Kuperberg2 , and Orna Kupferman1 1 2 The Hebrew University, Israel.

Regular Sensing Shaull Almagor1 , Denis Kuperberg2 , and Orna Kupferman1 1 2 The Hebrew University, Israel.

Add to Reading List

Source URL: www.liafa.univ-paris-diderot.fr

Language: English - Date: 2014-10-15 08:28:09
24Foundations of Software Technology and Theoretical Computer ScienceSubmission Quasi-Weak Cost Automata: A New Variant of Weakness∗ Denis Kuperberg1 , Michael Vanden Boom2 1 L IAFA /CNRS/Universit´

Foundations of Software Technology and Theoretical Computer ScienceSubmission Quasi-Weak Cost Automata: A New Variant of Weakness∗ Denis Kuperberg1 , Michael Vanden Boom2 1 L IAFA /CNRS/Universit´

Add to Reading List

Source URL: www.liafa.univ-paris-diderot.fr

Language: English - Date: 2012-10-25 13:52:51
25LINEAR TEMPORAL LOGIC FOR REGULAR COST FUNCTIONS DENIS KUPERBERG Liafa/CNRS/Université Paris 7, Denis Diderot, France

LINEAR TEMPORAL LOGIC FOR REGULAR COST FUNCTIONS DENIS KUPERBERG Liafa/CNRS/Université Paris 7, Denis Diderot, France

Add to Reading List

Source URL: www.liafa.univ-paris-diderot.fr

Language: English - Date: 2014-05-08 11:47:02
26Determinisation of history-deterministic automata 1 1 Denis Kuperberg , Michał Skrzypczak

Determinisation of history-deterministic automata 1 1 Denis Kuperberg , Michał Skrzypczak

Add to Reading List

Source URL: www.liafa.univ-paris-diderot.fr

Language: English - Date: 2014-07-04 07:26:19
27ACRS_main-revised-april2014.dvi

ACRS_main-revised-april2014.dvi

Add to Reading List

Source URL: logica.ugent.be

Language: English - Date: 2014-06-16 09:06:25
28Invariants for equivalence of finite automata Mike Spivey Let S = (S, Σ, δS , s0 , FS ) and T = (T , Σ, δT , t0 , FT ) be two deterministic finite automata with the same alphabet Σ. We say S and T are equivalent if,

Invariants for equivalence of finite automata Mike Spivey Let S = (S, Σ, δS , s0 , FS ) and T = (T , Σ, δT , t0 , FT ) be two deterministic finite automata with the same alphabet Σ. We say S and T are equivalent if,

Add to Reading List

Source URL: spivey.oriel.ox.ac.uk

Language: English - Date: 2010-02-09 12:35:41
29Nondeterminism in the Presence of a Diverse or Unknown Future ? Udi Boker1 , Denis Kuperberg2 , Orna Kupferman2 , and Michał Skrzypczak3 1 2

Nondeterminism in the Presence of a Diverse or Unknown Future ? Udi Boker1 , Denis Kuperberg2 , Orna Kupferman2 , and Michał Skrzypczak3 1 2

Add to Reading List

Source URL: www.liafa.univ-paris-diderot.fr

Language: English - Date: 2013-04-29 05:18:08
30Deciding the weak definability of Büchi definable tree languages∗ Thomas Colcombet1 , Denis Kuperberg2 , Christof Löding3 , and Michael Vanden Boom4 1,2 CNRS and LIAFA, Université Paris Diderot Paris, France

Deciding the weak definability of Büchi definable tree languages∗ Thomas Colcombet1 , Denis Kuperberg2 , Christof Löding3 , and Michael Vanden Boom4 1,2 CNRS and LIAFA, Université Paris Diderot Paris, France

Add to Reading List

Source URL: www.automata.rwth-aachen.de

Language: English - Date: 2013-08-07 05:31:08